Solving Generalized Semi-Infinite Programming Problems with a Trust Region Method
نویسندگان
چکیده
منابع مشابه
Solving Generalized Semi-Infinite Programming Problems with a Trust Region Method
In this paper, a trust region method for generalized semi-infinite programming problems is presented. The method is based on [O. Yi-gui, “A filter trust region method for solving semi-infinite programming problems”, J. Appl. Math. Comput. 29, 311 (2009)]. We transformed the method from standard to generalized semi-infinite programming problems. The semismooth reformulation of the Karush–Kuhn–Tu...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملA Branch and Bound Approach for Solving a Class of Generalized Semi-Infinite Programming Problems
A nonconvex generalized semi-infinite programming problem is considered involving parametric max-functions in both, the objective and the constraints. For a fixed vector of parameters, the values of these parametric max-functions are given as optimal values of convex quadratic programming problems. Assuming that for each parameter the parametric quadratic problems satisfy the strong duality rel...
متن کاملSolving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques
We describe a new possibility to model disjunctive optimization problems as generalized semi-infinite programs. In contrast to existing methods, for our approach neither a conjunctive nor a disjunctive normal form is expected. Applying existing lower level reformulations for the corresponding semi-infinite program we derive conjunctive nonlinear problems without any logical expressions, which c...
متن کاملA conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
We consider a generalized semi-infinite programming problem (GSIP) with one semi-infinite constraint where the index set depends on the variable to be minimized. Keeping in mind the integral global optimization method of Zheng & Chew and its modifications we would like to outline theoretical considerations for determining coarse approximations of a solution of (GSIP) via global optimization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Polonica A
سال: 2015
ISSN: 0587-4246,1898-794X
DOI: 10.12693/aphyspola.128.b-93